A Hybrid GRASP - Evolutionary Algorithm Approach to Golomb Ruler Search
نویسندگان
چکیده
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This EA incorporates ideas from greedy randomized adaptive search procedures (GRASP) in order to perform the genotype-to-phenotype mapping. As it will be shown, this hybrid approach can provide high quality results, better than those of reactive GRASP and other EAs.
منابع مشابه
A Memetic Approach to Golomb Rulers
Finding Golomb rulers is an extremely challenging optimization problem with many practical applications. This problem has been approached by a variety of search methods in recent years. We consider in this work a hybrid evolutionary algorithm that incorporates ideas from greedy randomized adaptive search procedures (GRASP), tabu-based local search methods (TS) and scatter search (SS). In partic...
متن کاملOptimal Golomb Ruler Sequences asWDM Channel-Allocation Algorithm Generation: Cuckoo Search Algorithm with Mutation
With the hailing winds of development, humans are still can’t fully act individually, the dependency over the nature is indispensable. In this paper, a hybrid nature inspired based algorithm named Cuckoo search algorithm with mutation (CSAM) has been used to solve the channel–allocation problem presents in optical wavelength division multiplexing (WDM) systems. The channels can be allocated by ...
متن کاملEvolving the Maximum Segment Length of a Golomb Ruler
An evolutionary algorithm based on Random Keys to represent Golomb Rulers segments has been found to be a reliable option for finding Optimal Golomb Rulers in a short amount of time, when comparing with standard methods. This paper presents a modified version of this evolutionary algorithm where the maximum segment length for a Golomb Ruler is also part of the evolutionary process. Attained exp...
متن کاملGolomb Rulers: The Advantage of Evolution
In this paper we present a new evolutionary algorithm designed to efficiently search for optimal Golomb rulers. The proposed approach uses a redundant random keys representation to codify the information contained in a chromosome and relies on a simple interpretation algorithm to obtain feasible solutions. Experimental results show that this method is successful in quickly identifying good solu...
متن کاملOn the Design of Optimum Order 2 Golomb Ruler
A Golomb ruler with M marks can be defined as a set {ai} of integers so that all differences δij = aj − ai, i 6= j, are distinct. An order 2 Golomb ruler is a Golomb ruler such that all differences δijk` = |δk` − δij |, {i, j} 6 = {k, `}, are distinct as much as possible. Contruction of optimum order 2 Golomb ruler, i.e., of rulers of minimum length, is a highly combinatorial problem which has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004